shen's conjecture on group with given same order type
نویسندگان
چکیده
for any group $g$, we define an equivalence relation $thicksim$ as below: [forall g, h in g gthicksim h longleftrightarrow |g|=|h|] the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$. in this paper, we give a partial answer to a conjecture raised by shen. in fact, we show that if $g$ is a nilpotent group, then $|pi(g)|leq |alpha{(g)}|$, where $pi(g)$ is the set of prime divisors of order of $g$. also we investigate the groups all of whose proper subgroups, say $h$ have $|alpha{(h)}|leq 2$.
منابع مشابه
shen's conjecture on groups with given same order type
for any group $g$, we define an equivalence relation $thicksim$ as below: [forall g, h in g gthicksim h longleftrightarrow |g|=|h|] the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$. in this paper, we give a partial answer to a conjecture raised by shen. in fact, we show that if $g$ is a nilpot...
متن کاملOn Fraisse's Order Type Conjecture
ing from the embeddability relation between order types, define a quasi-order to be a reflexive, transitive relation. Throughout this paper, the letters Q and R will range over quasi-ordered sets and classes. Various quasi-ordered spaces will be defined; in each case we will use the symbol < (perhaps with subscripts) to denote the quasi-order under consideration. If q1, q2 E Q, write ql < q2 to...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملthe past hospitalization and its association with suicide attempts and ideation in patients with mdd and comparison with bmd (depressed type) group
چکیده ندارد.
ON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of group theoryناشر: university of isfahan
ISSN 2251-7650
دوره
شماره Articles in Press 2015
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023